Function Optimization using Guided Local Search
نویسندگان
چکیده
In this report, we examine the potential use of Guided Local Search (GLS) for function optimization. In order to apply GLS, the function to be minimized is augmented with a set of penalty terms that enable local search to escape from local minima. The function F6 is used to demonstrate the proposed technique.
منابع مشابه
A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem
Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...
متن کاملThe Application of Pareto Local Search to the Single-Objective Quadratic Assignment Problem
Pareto optimization, that includes the simultaneous optimization of multiple conflict objectives, has been employed as a high level strategy to reduce the effect of local optima (Segura et al. 2013). This approach was first introduced in (Louis and Rawlins 1993), and later reinvestigated and termed as multi-objectivization in (Knowles, Watson, and Corne 2001). Since then it has been studied by ...
متن کاملGLSDock - Drug Design Using Guided Local Search
The guided local search method has been successfully applied to a significant number of NP-hard optimization problems, producing results of similar caliber, if not better, compared to those obtained from algorithms specially designed for each singular optimization problem. Ranging from the familiar TSP and QAP to general function optimization problems, GLS sits atop many well-known algorithms s...
متن کاملSolving the Radio Link Frequency Assignment Problem using Guided Local Search
In this paper, we examine the application of the combinatorial optimisation technique of Guided Local Search to the Radio Link Frequency Assignment Problem (RLFAP). RLFAP stems from real world situations in military telecommunications and it is known to be an NP-hard problem. Guided Local Search is a metaheuristic that sits on top of local search procedures allowing them to escape from local mi...
متن کاملPath-Guided Mutation for Stochastic Pareto Local Search Algorithms
Stochastic Pareto local search (SPLS) methods are local search algorithms for multi-objective combinatorial optimization problems that restart local search from points generated using a stochastic process. Examples of such stochastic processes are Brownian motion (or random processes), and the ones resulting from the use of mutation and recombination operators. We propose a path-guided mutation...
متن کامل